Search results for "Hierarchical routing"
showing 7 items of 7 documents
Addressing Manufacturing Challenges with Cost-Efficient Fault Tolerant Routing
2010
The high-performance computing domain is enriching with the inclusion of Networks-on-chip (NoCs) as a key component of many-core (CMPs or MPSoCs) architectures. NoCs face the communication scalability challenge while meeting tight power, area and latency constraints. Designers must address new challenges that were not present before. Defective components, the enhancement of application-level parallelism or power-aware techniques may break topology regularity, thus, efficient routing becomes a challenge.In this paper, uLBDR (Universal Logic-Based Distributed Routing) is proposed as an efficient logic-based mechanism that adapts to any irregular topology derived from 2D meshes, being an alter…
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm
2017
[EN] The Hierarchical Mixed Rural Postman Problem is defined on a mixed graph where arcs and edges that require a service are divided into clusters' that have to be serviced in a hierarchical order. The problem generalizes the Mixed Rural Postman Problem and thus is NP-hard. In this paper, we provide a polyhedral analysis of the problem and propose a branch-and-cut algorithm for its solution based on the introduced classes of valid inequalities. Extensive computational experiments are reported on benchmark instances. The exact approach allows to find the optimal solutions in less than 1 hour for instances with up to 999 vertices, 2678 links, and five clusters.
A combined relay-selection and routing protocol for cooperative wireless sensor networks
2012
International audience; In wireless sensor networks several constraints decrease communications performances. In fact, channel randomness and energy restrictions make classical routing protocols inefficient. Therefore, the design of new routing protocols that cope with these constraints become mandatory. The main objective of this paper is to present a multi-objective routing algorithm RBCR that computes routing path based on the energy consumption and channel qualities. Additionally, the channel qualities are evaluated based on the presence of relay nodes. Compared to AODV and AODV associated to a cooperative MAC protocol, RBCR provides better performances in term of delivery ratio, power …
QoS Based Routing Protocol for Intra-Mesh Infrastructure Communications
2015
International audience; Mesh Networks (WMNs) have been considered as a promising alternative to conventional wired networks, thanks to its flexibility and easy deployment. Thus, to ensure a satisfying level of QoS guarantees for real-time and streaming applications such as Voice over IP (VoIP) and Video on Demand (VoD), we propose a novel QoS based routing protocol for wireless mesh environments, called Hybrid QoS Mesh Routing (HQMR), jointly with a clustering algorithm to enhance scalability issues within the mesh infrastructure. HQMR is composed of two routing sub-protocols: a reactive routing sub-protocol for intra-infrastructure communications and a proactive QoS based multi-tree routin…
A secure intersection-based routing protocol for data collection in urban vehicular networks
2014
Data routing has gained great intention since the appearance of Vehicular Networks (VANETs). However, in the presence of attackers, reliable and trustworthy operations in such networks become impossible without securing routing protocols. In this paper, we target to study and design a secure routing protocol S-GyTAR for vehicular environments. Several kinds of routing techniques are proposed in the literature and could be classified into topology-based or position-based strategies. Position-based is the most investigated strategy in vehicular networks due to the unique characteristics of such networks. For this reason, this work is based on the well-known intersection-based routing protocol…
SUBOPTIMAL-OPTIMAL ROUTING FOR LAN INTERNETWORKING USING TRANSPARENT BRIDGES
1998
The current standard transparent bridge protocol IEEE-802.1D is based on the Spanning Tree (ST) algorithm. It has a very important restriction: it cannot work when the topology has active loops. Therefore, a tree is the only possible interconnection topology that can be used. The ST algorithm guarantees that the active topology is a tree discarding lines that form loops. However, because of this, network bandwidth cannot be fully utilized. Moreover, trees have a very serious bottleneck near the root. This paper proposes a new transparent bridge protocol for LAN interconnection that allows active loops. Therefore, strongly connected regular topologies like tori, hypercubes, meshes, etc., as…
A service-oriented routing scheme with load balancing in wireless mesh networks
2008
Wireless mesh networks will play an important role in the next-generation wireless communication systems as it can provide wide coverage and scalable broadband Internet access services. However, congestion in such networks may lead to throughput degradation, packet loss and longer transmission delay. Therefore, routing and traffic forwarding schemes which are aware of the congestion status of a wireless network can efficiently improve network performance. In this paper, we propose a new congestion-aware routing scheme which may direct different paths for different services types, according to network congestion status. The goal of this routing scheme is to use traffic load metric for choosi…